On the Structure of Parameterized Problems in NP (Extended Abstract)
نویسندگان
چکیده
Fixed-parameter intractability of optimization problems in NP is studied based on computational models with limited nondeterminism. Strong evidence is provided that many NP optimization problems are not fixed-parameter tractable and that the fixed-parameter intractability hierarchy (the W -hierarchy) does not collapse.
منابع مشابه
How Hard is Control in Multi-Peaked Elections: (Extended Abstract)
We study the complexity of voting control problems in multi-peaked elections. In particular, we focus on the constructive/destructive control by adding/deleting votes under Condorcet, Maximin and Copeland voting systems. We show that the NP-hardness of these problems (except for the destructive control by adding/deleting votes under Condorcet, which is polynomial-time solvable in the general ca...
متن کاملExtended Spanning Star Forest Problems
We continue the investigation proposed in [COCOA 2016, Weller, Chateau, Giroudeau, König and Pollet “On Residual Approximation in Solution Extension Problems”] about the study of extended problems. In this context, a partial feasible solution is given in advance and the goal is to extend this partial solution. In this paper, we focus on the edge-weighted spanning star forest problem for both mi...
متن کاملSome New Analytical Techniques for Duffing Oscillator with Very Strong Nonlinearity
The current paper focuses on some analytical techniques to solve the non-linear Duffing oscillator with large nonlinearity. Four different methods have been applied for solution of the equation of motion; the variational iteration method, He’s parameter expanding method, parameterized perturbation method, and the homotopy perturbation method. The results reveal that approxim...
متن کاملEvaluation of Bi-objective Scheduling Problems by FDH, Distance and Triangle Methods
In this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimi...
متن کاملEvaluation of Bi-objective Scheduling Problems by FDH, Distance and Triangle Methods
In this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 123 شماره
صفحات -
تاریخ انتشار 1994